Speculative Execution for Information Agents

نویسندگان

  • Greg Barish
  • Craig A. Knoblock
  • Steven Minton
چکیده

Practical deployments of information agents can suffer from sub-optimal performance and scalability for a number of reasons. In the case of web-based information integration, for example, data sources are remote and their latency can have a substantial effect on overall execution performance. Scalability can also be poor, since concurrent queries can cause multiple, simultaneous remote data retrievals (often of the same information), quickly consuming available bandwidth. The frequency of remote retrievals also makes such agents inherently I/O-bound, wasting CPU cycles. One way of optimizing execution in such scenarios is to engage in speculative execution. Tasks likely to be executed in the future can be performed in advance, such as when an agent is I/O-bound. Correctly guessing can be profitable – the overall end-to-end application could perform faster, bandwidth could be conserved, and the CPU could be scheduled more optimally. Still, designing a technique for speculative information agent execution is not simple. For one, there are competing justifications. For example, an agent could speculate based on the profile of a current user or on the activity of past clients, or on resource availability. Secondly, speculation itself incurs additional overhead: it should not interfere with normal execution and there must be some method of coordinating speculative execution between multiple agents. Third, speculative execution itself needs to be scalable hinting done on a per-user basis could lead to a prohibitive number of hints in popular agents. Consider an “information portal” application, where users can view news headlines and stock quotes and charts. Suppose that 90% of the users currently logged into the system have portfolios that contain Cisco Systems stock. In this case, we could speculate that at least one will request detailed information about this stock and thus we could pre-fetch this data, or just the costly part (for example, the chart graphic). Note that the idea of speculative execution is not limited to pre-fetching data. Other costly operators

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Speculative Plan Execution for Information Agents

.........................................................................................................................xiii 1. ...................................................................................................................

متن کامل

Speculative constraint processing for hierarchical agents

Speculative computation is an effective means for solving problems with incomplete information in multi-agent systems. It allows such a system to compute tentative solutions by using default information about agents even if communications between agents delayed or failed. Previously we have proposed a logical framework for speculative constraint processing for master-slave multi-agent systems. ...

متن کامل

Dynamic Speculative Attacks

The paper presents a model of rational Bayesian agents with speculative attacks in a regime of exchange rate which is pegged within a band. Speculators learn from the observation of the exchange rate within the band whether their mass is sufficiently large for a successful attack. Multiple periods are necessary for the existence of speculative attacks. Various defense policies are analyzed. A t...

متن کامل

Speculative plan execution for information gathering

The execution performance of an information gathering plan can suffer significantly due to remote I/O latencies. A streaming dataflow model of execution addresses the problem to some extent, exploiting all natural opportunities for parallel execution, as allowed by the data dependencies in a plan. Unfortunately, plans that integrate information from multiple sources often use the results of one...

متن کامل

Speculative Execution for Information Gathering Plans

Although information gathering plans have enabled data from remote heterogeneous sources to be easily combined and queried, their execution performance suffers because access to remote sources is often slow. To address this problem, we have developed a method of speculative execution that increases the degree of run-time parallelism during plan execution. Our approach allows any information gat...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000